package com.chilly.vidio.study.leetcode;

/**
 * @author Chilly Cui
 * @createDate 2021/3/3
 */
public class No209 {

    static class Solution{
        public void sumSort(int[] arr, int k){
            int ans = -1;
            for (int i = 0; i < arr.length - k + 1; i++) {
                int currentSum = 0;
                for (int j = 0; j < k; j++) {
                    currentSum = currentSum+arr[j]+arr[i];
                }
            }
        }
    }
}
